A KNN Learning Algorithm for Collusion-Resistant Spectrum Auction in Small Cell Networks
نویسندگان
چکیده
منابع مشابه
Auction design and tacit collusion in FCC spectrum auctions
The Federal Communications Commission (FCC) has used auctions to award spectrum since 1994. During this time period, the FCC has experimented with a variety of auctions rules including click box bidding and anonymous bidding. These rule changes make the actions of bidders less visible during the auction and also limit the set of bids that can be submitted during a particular round. Economic the...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Auction Design with Tacit Collusion∗
We study an auction design problem where the auctioneer anticipates that bidders collude tacitly. We model tacit collusion in the following way: whichever auction the auctioneer announces, it becomes the stage game of a corresponding repeated game, and out of all sequential equilibria of the resulting repeated game, bidders play the one that maximizes their total ex ante payoff. We show that an...
متن کاملThe Cascade Auction - A Mechanism for Deterring Collusion in Auctions
We introduce a sealed bid auction of a single item in which the winner is chosen at random among the highest k bidders according to a fixed probability distribution, and the price for the chosen winner is the Vickrey-Clarke-Groves price. We call such an auction a cascade auction. Our analysis suggests that this type of auction may give higher revenues compared to second price auction in cases o...
متن کاملThe kNN-TD Reinforcement Learning Algorithm
A reinforcement learning algorithm called kNN-TD is introduced. This algorithm has been developed using the classical formulation of temporal difference methods and a k-nearest neighbors scheme as its expectations memory. By means of this kind of memory the algorithm is able to generalize properly over continuous state spaces and also take benefits from collective action selection and learning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2861840